| 翻訳と辞書 |
Radial tree
A radial tree, or radial map, is a method of displaying a tree structure (e.g., a tree data structure) in a way that expands outwards, radially. It is one of many ways to visually display a tree,〔(Various 2-D radial graph and network visualizations, from SpicyNodes documentation )〕〔http://www.visualcomplexity.com/vc/project.cfm?id=26〕 with examples extending back to the early 20th century.〔http://www.visualcomplexity.com/vc/project.cfm?id=289〕 In use, it is a type of information graphic.
== Comparison to other layouts ==
In a simple case, the first node is at the top, and the linked nodes are beneath. As each node typically has more than one child, the resulting shape is relatively triangular. In a radial layout, instead of each successive generation being displayed a row below, each generation is displayed in a new, outer orbit.
Since the length of each orbit increases with the radius, there tends to be more room for the nodes. A radial tree will spread the larger number of nodes over a larger area as the levels increase. We use the terms level and depth interchangeably.〔Greg Book & Neeta Keshary. "Radial Tree Graph Drawing Algorithm for Representing Large Hierarchies." University of Connecticut December 2001〕 Nevertheless, the number of nodes increases exponentially with the distance from the first node, whereas the circumference of each orbit increases linearly, so by the outer orbits, the nodes tend to be packed together.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Radial tree」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|